Tarski ’ s Claim thirty years later

نویسنده

  • Adrian Rezuş
چکیده

Tarski’s Claim (TC = Theorem 8 in [13]) follows from simple considerations in (type-free) lambda-calculus. The present note records essentially a proof of Lemma 1.1 in [16], i.e. TCL = the type-free lambdacalculus variant of TC, as well as a few historical comments appearing there. Additional remarks are meant to insure the fact that TCL can be transferred verbatim to typed lambda-calculus [TCLT]. (TCLT is just a notational variant of the derivation of TC in ordinary Lukasiewicz / traditional style.) The Addendum contains a transcription, in type-free lambda-calculus terms, of a Lukasiewicz / traditional style derivation of TC (notationally equivalent to TCLT), due to John Halleck [6] (September, 2010). Tarski’s Claim. Alfred Tarski claimed in 1925, without proof, the following (meta-) statement [hereafter TC]: Let L be a propositional logic in a propositional language containing at least implication (→). If L is finitely axiomatizable with modus ponens for → (and substitution) then L is also axiomatizable with a single axiom, and modus ponens (and substitution), provided it contains [K] p→(q→p) – [irrelevance] [D] p→(q→((p→(q→r))→r)) – [pairing] as theorems (‘theses’). Apparently, the Claim above was first mentioned in print in 1929, by Stanis law Leśniewski, Tarski’s PhD advisor, in [10], §§1–11. Tarski published his Claim slightly later, still without a proof, as Theorem 8, in [13]. Beyond Leśniewski, the original proof of TC was known to other Polish logicians, during the early twenties (as, e.g., to Jan Lukasiewicz), as well as to some other people, mathematicians and / or philosophers, at a later time. Among them one could mention, for instance, Carew A. Meredith (who attended Lukasiewicz’s lectures held at the Royal Irish Academy from 1947 on, cf. [14], page 514) and his occasional collaborator, Arthur N. Prior (cf., e.g., [15], §10, page 181). In retrospect, it is also likely that one could have included Bo leslaw Sobociński in the list. On the other hand, by the end of the seventies, any information as regards the ‘original method’ of proof seems to have been irretrievably lost. So, David Meredith (Carew’s cousin), in correspondence: 1Cf. pp. 58–59, in the German original; the full paper, containing also §12, dated 1938, appears, in English translation, in his Collected Works [11], II, pp. 410–605; cf., specifically, [11], II, §10, page 467.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How Tarski defined the undefinable CEZARY CIE Ś LI Ń SKI

Alfred Tarski, one of the greatest logicians of all time, was born as Alfred Tajtelbaum in 1901. He came from a Jewish family living in Warsaw. In 1918-24 he studied at the University of Warsaw, initially biology, and then mathematics. At this time Warsaw was becoming one of the world leading centers in the area of logic and mathematics. Tarski’s logic teachers were Jan Łukasiewicz and Stanisła...

متن کامل

On the Matter of Essential Richness

Alfred Tarski (1944) wrote that “the condition of the ‘essential richness’ of the metalanguage proves to be, not only necessary, but also sufficient for the construction of a satisfactory definition of truth.” But it has remained unclear what Tarski meant by an ‘essentially richer’ metalanguage. Moreover, DeVidi and Solomon (1999) have argued in this Journal that there is nothing that Tarski co...

متن کامل

On Completeness of Dynamic Topological Logic

A classical result on topological semantics of modal logic due to McKinsey and Tarski (often called Tarski theorem) states that the logic S4 is complete with respect to interpretations in R for each n. Recently several authors have considered dynamic topological logics, which are interpreted in dynamic spaces (abstract dynamic systems). A dynamic space is a topological space together with a con...

متن کامل

Tarski Number and Configuration Equations

The concept of configuration of groups which is defined in terms of finite partitions and finite strings of elements of the group is presented by Rosenblatt and Willis. To each set of configurations, a finite system of equations known as configuration equations, is associated. Rosenblatt and Willis proved that a discrete group G is amenable if and only if every possible instance of its configur...

متن کامل

Work status after workers' compensation claims for upper limb musculoskeletal disorders.

AIM To provide information on employment status after workers' compensation (WC) claims for musculoskeletal disorders of the limbs (MSDs). METHODS Two-year follow up of the workers who filed a WC claim for MSDs in 1996 in the Pays de la Loire region. Of the 701 eligible workers, 514 workers (70%) participated. Information was requested by means of a mailed questionnaire about the characterist...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010